Parallel Community Mining in Social Network using Map-reduce
نویسندگان
چکیده
The mobile social network plays an essential role as the spread of information and relationship. This paper proposes a parallel algorithm based on MapReduce for finding community in a mobile social network where individuals communicate with one another using mobile phones with register identification information and analyzes the behavior of the communication patterns with taking the actual call detail records received and dialed by users into account. The proposal algorithm is composed of three main components map, reduce and merge for mining groups and a dynamic programming algorithm for selecting subgroups to combine into a big community. Empirical studies on a large real-world mobile social network show that performance of our algorithm is an effective and fast algorithm for mining community in social network.
منابع مشابه
Community Detection using a New Node Scoring and Synchronous Label Updating of Boundary Nodes in Social Networks
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
متن کاملDetecting Overlapping Communities in Social Networks using Deep Learning
In network analysis, a community is typically considered of as a group of nodes with a great density of edges among themselves and a low density of edges relative to other network parts. Detecting a community structure is important in any network analysis task, especially for revealing patterns between specified nodes. There is a variety of approaches presented in the literature for overlapping...
متن کاملMining Overlapping Communities in Real-world Networks Based on Extended Modularity Gain
Detecting communities plays a vital role in studying group level patterns of a social network and it can be helpful in developing several recommendation systems such as movie recommendation, book recommendation, friend recommendation and so on. Most of the community detection algorithms can detect disjoint communities only, but in the real time scenario, a node can be a member of more than one ...
متن کاملComparing Data Processing Frameworks for Scalable Clustering
Recent advances in the development of data parallel platforms have provided a significant thrust to the development of scalable data mining algorithms for analyzing massive data sets that are now commonplace. Scalable clustering is a common data mining task that finds consequential applications in astronomy, biology, social network analysis and commercial domains. The variety of platforms avail...
متن کاملMarket Basket Analysis Algorithm on Map/Reduce in AWS EC2
As the web, social networking, and smartphone application have been popular, the data has grown drastically everyday. Thus, such data is called Big Data. Google met Big Data earlier than others and recognized the importance of the storage and computation of Big Data. Thus, Google implemented its parallel computing platform with Map/Reduce approach on Google Distributed File Systems (GFS) in ord...
متن کامل